package moniPriortyQueue;

public class Test {
    public static void main(String[] args) {
        TestHeap testHeap=new TestHeap();
        int[] array={27,15,19,18,28,34,65,49,25,37};
        testHeap.initHeap(array);
        testHeap.createHeap();
        //时间复杂度分析：最坏情况 从根一路比较到叶子，比较的次数为完全二叉树的高度，时间复杂度为 O(log^2 n)
        System.out.println("===== 插入元素 80 ======");
       /* testHeap.offer(80);*/
        System.out.println("=============");
        int val=testHeap.poll();
        System.out.println(val);
        System.out.println("============");
    }
}
